package tree.binary_tree.heap;

import tree.binary_tree.heap.app.HeapSort;

/**
 * @author yeyangtao created at 11:45 2020/10/15
 */
public class MyHeapTest {
    public static void main(String[] args) {
        int[] a = {-1, 1, 5, 4, 3, 2, 6};
        HeapSort.sort(a, a.length - 1);
        for (int i : a) {
            System.out.println(i);
        }
    }
}
